Tree-like Decompositions of Simply Connected Domains
نویسندگان
چکیده
We show that any simply connected rectifiable domain Ω can be decomposed into Lipschitz crescents using only crosscuts of the domain and using total length bounded by a multiple of the length of ∂Ω. In particular, this gives a new proof of a theorem of Peter Jones that such a domain can be decomposed into Lipschitz disks. 1991 Mathematics Subject Classification. Primary: 68U05 Secondary: 26B15, 28A75 .
منابع مشابه
Tree-like Decompositions and Conformal Maps
Any simply connected rectifiable domain Ω can be decomposed into uniformly chord-arc subdomains using only crosscuts of the domain. We show that such a decomposition allows one to construct a map from Ω to the disk which is close to conformal in a uniformly quasiconformal sense. This answers a question of Stephen Vavasis. 1991 Mathematics Subject Classification. Primary: 30C35 Secondary: 30C30,...
متن کاملTree-Decompositions with Connected Clusters for Solving Constraint Networks
From a theoretical viewpoint, the (tree-)decomposition methods offer a good approach for solving Constraint Satisfaction Problems (CSPs) when their (tree)-width is small. In this case, they have often shown their practical interest. So, the literature (coming from Mathematics or AI) has concentrated its efforts on the minimization of a single parameter, the tree-width. Nevertheless, experimenta...
متن کاملImproving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning
Dynamic Programming (DP) over tree decompositions is a well-established method to solve problems – that are in general NP-hard – efficiently for instances of small treewidth. Experience shows that (i) heuristically computing a tree decomposition has negligible runtime compared to the DP step; (ii) DP algorithms exhibit a high variance in runtime when using different tree decompositions; in fact...
متن کاملBag-Connected Tree-Width: A New Parameter for Graph Decomposition
For solving constraints networks (CSPs), (tree-)decomposition methods have shown their practical interest. But for the problem of computing tree-decompositions, the literature (coming from AI or from Mathematics) has concentrated the work on a single parameter, the tree-width. Nevertheless, experimental studies have shown that when a decomposition is used to solve a CSP, other parameters must a...
متن کاملQuasi-Primary Decomposition in Modules Over Proufer Domains
In this paper we investigate decompositions of submodules in modules over a Proufer domain into intersections of quasi-primary and classical quasi-primary submodules. In particular, existence and uniqueness of quasi-primary decompositions in modules over a Proufer domain of finite character are proved. Proufer domain; primary submodule; quasi-primary submodule; classical quasi-primary; decompo...
متن کامل